Network & System Project Titles
S.NO.
|
Network & System Project
Titles |
Lang
|
1. |
Multicast
Live Video Broadcasting Using Real Time Transmission Abstract: In this
paper, we address the problem of real-time video streaming over wireless LANs
for both unicast and multicast transmission. The wireless channel is modeled
as a packet-erasure channel at the IP level. For the unicast scenario, we
describe a novel hybrid Automatic Repeat reQuest (ARQ) algorithm that
efficiently combines forward error control (FEC) coding with the ARQ
protocol. For the multiple-users scenario, we formulate the problem of
real-time video multicast as an optimization of a maximum regret cost
function across the multicast user space. AUDIO and video streaming
over wired networks, such as the Internet, have been popular now for quite
some time. However, with the development of broadband wireless networks,
attention has only recently turned to delivering video over wireless
networks. In this paper, we focus on the wireless Local Area Network (LAN),
which can operate at high enough bit rates to allow transmission of high
quality video data. Specifically, we investigate the IEEE 802.11b wireless
LAN, though the ideas that we present are applicable to other wireless
networks as well. |
Java |
2. |
Server and Clients Node Capture Attacks Abstract: In this project, we addressed the
mitigation of control channel jamming by malicious colluding insiders and
compromised system users as well as the identification of compromised users
without prior knowledge of the number of compromised users in the system. We
mapped the problem of control channel access that is robust to jamming by
compromised users to the problem of secure key establishment under node
capture attacks. Based on the mapping, we proposed a framework for control
channel access schemes using random key assignment. We proposed and evaluated
metrics for resilience and delay which quantify the availability of control
messages under control channel jamming attacks. In future work, we will
investigate modifications to the adversary’s jamming strategy and the effect
on the availability of control messages and the ability to identify
compromised users. |
Java |
3. |
Multi Server
Communication In Distributed Management System Abstract: This approach has the potential of both
distributing the operation processing load among the proxies and enabling
clients to access the service by communicating with nearby proxies rather
than a potentially distant centralized server. However, achieving even just
serializability for operations executed at these proxies using standard
replication approaches requires that a proxy involve either a centralized
server or other (possibly distant) proxies on the critical path of each
update operation. Our system implements a service with a designated server
and an unbounded number of proxies. We generically refer to the server and
the proxies as processes. To support the service, a proxy joins the service. In
doing so, it is positioned within a tree rooted at the server. All proxies in
the subtree rooted at that child are said to disconnect. The child (or, if
the child failed, each uppermost surviving proxy in the subtree) can inform
its subtree of the disconnection. The subtree can stay put until the
disconnection heals, or they might reconnect via the server. |
Java |
4. |
Intercity Search Query Processing Abstract:
This project presented a novel approach for reducing the spatial query access
latency by leveraging results from nearby peers in wireless broadcast
environments. Significantly, our scheme allows a mobile client to locally
verify whether candidate objects received from peers are indeed part of its
own spatial query result set. The experiment results indicate that our method
can reduce the access to the wireless broadcast channel by a significant
amount, for example, up to 80 percent, in a dense urban area. This is
achieved with minimal caching at the peers. By virtue of its P2P
architecture, the method exhibits great scalability: the higher the mobile
peer density, the more the queries answered by peers. Therefore, the query
access latency can be markedly decreased with the increase in clients. |
Java |
5. |
Data Transferring Congestion and Delay Rate Calculate Abstract: End-To-End
packet delay is one of the canonical metrics in Internet Protocol (IP)
networks, and is important both from the network operator and application
performance points of view. For example the quality of TCP IP is directly
dependent on delay, and network providers may have Service Level Agreements
specifying allowable values of delay Statistics across the domains they
control. An important component of end-to-end delay is that due to forwarding
elements, the fundamental building block of which is the delay incurred when
a packet passes through a single IP router. All input and output links were
monitored, allowing a complete picture of congestion and in particular router
delays, to be obtained. Packet delays and congestion are fundamentally
linked, as the former occur precisely because periods of temporary resource
starvation, or micro congestion episodes, are dealt with via
buffering. |
Java |
6. |
Active Source
Routing Protocol for Mobile AD-HOC Networks |
Java |
7. |
Data Traveling Minimum and Maximum Routers |
.Net |
8. |
Messaging
Service over TCP/IP in Local Area Network |
Java |
9. |
Multiple Chat Server Abstract: Chat Server is based on multi-tier server architecture to
provide high performance on heavy load sites and the ability to expose a rich
set of functionality like multi-user chat on standard protocols. The server
core is based on the open instant messaging protocol Jabber / XMPP, thus
allowing the integration with a wide set of clients and Jabber libraries.
Multi Chat Server also introduces new Jabber protocol extensions to allow
video conferencing over RTMP, or moderated / censored chat rooms for example.
The according graphical user interface is exposed by the Multi Chat
Flash-Client, to offer platform independent web integration. The
Architecture-Overview slide shows the parts and services belonging to the
Multi Chat Server solution. Basically, it consists of the Multi Chat Server
core, the Admin-Interface, a separate web server for configuration settings
and the Multi Chat database engine. |
Java |
10. |
Dynamic
Control for Cache Updating Network System Abstract: In
this project, we propose proactively disseminating the broken link
information to the nodes that have that link in their caches. Proactive cache
updating is key to making route caches adapt quickly to topology changes. It
is also important to inform only the nodes that have cached a broken link to
avoid unnecessary overhead. Thus, when a link failure is detected, our goal
is to notify all reachable nodes that have cached the link about the link
failure. We define a new cache structure called a cache table to maintain the
information necessary for cache updates. A cache table has no capacity limit;
its size increases as new routes are discovered and decreases as stale routes
are removed. Each node maintains in its cache table two types of information
for each route. The first type of information is how well routing information
is synchronized among nodes on a route: whether a link has been cached in
only upstream nodes, or in both upstream and downstream nodes, or neither. |
Java |
11. |
HTTP Proxy Server Abstract: In computer networks, a proxy server is a
server (a computer system or an application program) that acts as an
intermediary for requests from clients seeking resources from other servers.
A client connects to the proxy server, requesting some service, such as a
file, connection, web page, or other resource, available from a different
server. The proxy server evaluates the request according to its filtering
rules. For example, it may filter traffic by IP address or protocol. If the
request is validated by the filter, the proxy provides the resource by
connecting to the relevant server and requesting the service on behalf of the
client. A proxy server may optionally alter the client's request or the
server's response, and sometimes it may serve the request without contacting
the specified server. |
Java |
12. |
Location Based Search Engine Abstract: User
mobility and data exchange through wireless communication give Location Based
Search Engine some unique characteristics that the traditional spatial query
processing in centralized databases. In a mobile environment, a typical
Location Based Search Engine is of the form “find the top-three nearest
hospitals.” The result of the query depends on the location of its requester.
Caching and sharing of query results must take into consideration the
location of the query issuer. The database resides in a centralized server,
which typically serves a large mobile user community through wireless
communication. Due to user mobility, answers to an LBSE will lose their
relevancy if there is a long delay in query processing or in communication.
For example, answers to the query “find the top-three nearest hospitals”
received After 5 minutes of high-speed driving will become meaningless.
Instead, a prompt, albeit approximate, answer, telling the user right away
the approximate top-three nearest hospitals, may serve the user much better.
The wireless environment and the communication constraints play an important
role in determining the strategy for processing Location Based Search Engine. |
Java |
13. |
Effective
Packet Analyzing and Filtering System for ATM Network Abstract:
The TCP/IP protocol suite is the standard requirement for all applications
that need to communicate over the Internet. As TCP/IP applications are unable
to specify the QoS parameters needed for most Asynchronous Transfer Mode
(ATM) services, we tend to use the GCRA Algorithm. The purpose of Cell-Rate
Guarantees for Traffic across ATM Network is to provide QoS. ATM is a
connection-oriented switching technology, utilizing statistical multiplexing
of fixed-length packets, known as cells. The purpose of traffic control is to
minimize congestion. In an ATM network when the Source Machine continuously
sends cells to the Destination Machine through the Router Machine, there will
be a possibility of occurring congestion. When congestion occurs the Routing
Machine cannot accept more cells and hence these cells will be discarded.
This causes regeneration and retransmission of the discarded ATM cells. The objective
of this project is to simulate an overflowing ATM network and establish a
router with congestion control based on the GCRA algorithm. |
Java |
14. |
Packet Losses
Measurement Abstract: The purpose of our study
was to understand how to measure end-to-end packet loss characteristics
accurately with probes and in a way that enables us to specify the impact on
the bottleneck queue. We began by evaluating the capabilities of simple
Poisson-modulated probing in a controlled laboratory environment consisting
of commodity end hosts and IP routers. Measurement and estimation of packet loss characteristics are
challenging due to the relatively rare occurrence and typically short
duration of packet loss episodes. Measuring and analyzing network
traffic dynamics between end hosts has provided the foundation for the
development of many different network protocols and systems. Of particular
importance understands packet loss behavior since loss can have a significant
impact on the performance of both TCP- and UDP-based applications. |
Java |
15. |
Adaptive
Security and Authentication for DNS System |
Java |
16. |
Dynamic Routing with Security Considerations Abstract: In the past decades, various
security-enhanced measures have been proposed to improve the security of data
transmission over public networks. Existing work on security-enhanced data
transmission includes the designs of cryptography algorithms and system
infrastructures and security-enhanced routing methods. Another alternative
for security-enhanced data transmission is to dynamically route packets
between each source and its destination so that the chance for system
break-in, due to successful interception of consecutive packets for a
session, is slim. The intention of security-enhanced routing is different
from the adopting of multiple paths between a source and a destination to
increase the throughput of data transmission. The set of multiple paths
between each source and its destination is determined in an online fashion,
and extra control message exchanging is needed. |
Java |
17. |
Distributed
Node Migration by Effective Fault Tolerance Abstract: This project proposes an adaptive programming model for fault-tolerance
distributed computing, which provides upper-layer applications with process
state information according to the current system synchrony (or QoS). The
synchronous distributed computing model provides processes with bounds on
processing time and message transfer delay. These bounds, explicitly known by
the processes, can be used to safely detect process crashes and,
consequently, allow the noncrashed processes to progress with safe views of
the system state. Synchronous systems are attractive because they allow
system designers to solve many problems. The price that has to be paid is the
a priori knowledge on time bounds. If they are violated, the upper-layer
protocols may be unable to still guarantee their safety property. |
Java |
18. |
Data Traveling Random Direction using MANETs Abstract: In this work, we study both the
availability and the duration probability of a routing path that is subject
to link failures caused by node mobility. In particular, we focus on the case
where the network nodes move according to the Random Direction model, and we
derive both exact and approximate (but simple) expressions of these
probabilities. Through our results, we study the problem of selecting an
optimal route in terms of path availability.
In this work, we focus on the stability of a routing path, which is
subject to link failures caused by node mobility. We define the path duration
as the time interval from when the route is established until one of the
links along the route becomes unavailable, while we say that a path is
available. we focus on bi-dimensional random
mobility and we consider nodes moving according to the Random
Direction (RD) mobility model. |
.Net |
19. |
Secure Video
Data Hiding and Extraction Using BPCS Abstract: Steganography
is the practice of hiding or camouflaging secret data in an innocent looking
dummy container. This container may be a digital still image, audio file,
video file, or even a printed image. Once the data has been embedded, it may
be transferred across insecure lines or posted in public places. Therefore,
the dummy container should seem innocent under most examinations. The
proposed method is based on wavelet compression for video data and bit-plane
complexity segmentation (BPCS) steganography. |
Java |
20. |
Energy Maps for Mobile Wireless Networks Abstract: We
focus on the energy consumption as the end-to-end QoS metric, and describe a
novel method by which an energy map can be constructed and refined in the joint
memory of the mobile nodes. IN mobile networks, providing end-to-end
Quality-of-Service (QoS) guarantees, such as a guaranteed end-toend
throughput, delay, bit error rate, or energy consumption As a result, neither
proactive nor reactive routing protocols, which require that the paths that
are maintained or discovered remain stable, can provide end-to-end QoS
guarantees. In highly mobile networks, local routing protocols, such as
geographic routing, are able to route the data in the right direction; however,
they are unable to provide end-to-end QoS guarantees because the end-to-end
paths are still viewed as highly unreliable, and only dynamically and locally
determinable. The main assumption that underlies all of these approaches is
that a path is a fixed sequence of nodes. |
.Net |
21. |
RFID Authentication Abstract: RADIO Frequency Identification (RFID)
tags for the function of next-generation electronic product code (EPC) will
become one of the most widely used devices in the near future an RFID. Once
the tag is found valid, the back-end database will look up its product
information for further processing. RFID tags are classified into three
types: active, semi passive, and passive. Active tags contain batteries so
that they can actively communicate with the reader. Semi passive tags also
contain batteries but they wait for the reader’s query. As for passive tags,
the power comes from the reader. The class of a tag represents the effective
reading range. We analyzed the number of rounds required and the period of key update for practical
deployment. |
.Net |
22. |
Retrieving Files Using Content Based Search Abstract: The current project is divided into
four inter-dependent phases. Phase 1: Deals
with designing algorithms for summarizing and indexing text files. In case of
multimedia files the meta data files are created manually by the programmers.
This phase also involves algorithms for converting .doc and .pdf files to
.txt format. In this system the searching is not done at the run time as
indexing is done before hand. Phase 2: In
folders would be replaced by a new construct called a library. A
library is a virtual folder that intelligently gathers information about
files on the system and presents them to the users. The concept of folders
ceases to exist. Instead, the users are privileged enough to view similar
files together irrespective of their location in the physical memory. This
enables retrieval of files based on various parameters. This concept is named
as CAROUSEL VIEW after the proposed system with the same name to be launched
by the Microsoft’s Windows Longhorn which is a complete revolution in itself. Phase 3: Establishes
a common peer to peer (P2P) protocol that enables remote querying over other
terminals in the network. This module allows this software to be used across
the internet and also over various LANs. Phase 4: In
a nutshell, this project aims at creating a system which is highly enhanced
over the existing traditional ones and providing a user friendly environment.
|
Java |
23. |
Anti Void Routing for
Wireless Sensor Networks Abstract: A wireless sensor network (WSN)
consists of sensor nodes (SNs) with wireless communication capabilities for
specific sensing tasks. Due to the limited available resources, efficient
design of localized multi hop routing protocols becomes a crucial subject
within the WSNs anti-void routing
protocol is proposed to guarantee packet delivery with increased
routing efficiency by completely resolving the void problem based on the unit
disk graph setting. Several routing algorithms are proposed to either resolve
or reduce the void problem, which can be classified into Non-graph-based and
graph-based schemes. |
.Net |
24. |
Image Water
Marking and Combustion Abstract: Image Watermark
protects your pictures and photos by adding visible watermarks to them so
that they can't be replicated or stealed when published online. Watermarks
are blended and integrated in images and therefore will replace (in a
transparent way if you choose) some parts of your original image. Combustion processing creating
watermark technology using transparent or solid watermark. |
Java |
25. |
Router Link Failure Detection Abstract: In this project, we consider the
problem of fault localization in all-optical networks. We introduce the
concept of monitoring cycles (MCs) and monitoring paths (MPs) for unique
identification of router-link failures. They are constructed such that any single-link
failure results in the failure of a unique combination of MCs and MPs that
pass through the monitoring location(s). For a network with only one
monitoring location, we prove that three-edge connectivity is a necessary and
sufficient condition for constructing MCs that uniquely identify any
single-link failure in the network. |
.Net |
26. |
Wavelet
Based Compression and Decompression Using Steganography Technique Abstract:
This paper presents a steganography method using lossy compressed video which
provides a natural way to send a large amount of secret data. The proposed
method is based on wavelet compression for video data and bit-plane
complexity segmentation steganography. In wavelet based video compression
methods such as partitioning in hierarchical trees algorithm and Motion-
JPEG2000, wavelet coefficients in discrete wavelet transformed video are
quantized into a bit-plane structure and therefore BPCS steganography can be
applied in the wavelet domain. Presented a large capacity steganography
method applicable to compressed video which is invented based on BPCS
steganography and wavelet-based video compression. |
Java |
27. |
Cluster Building in Wireless Sensor Networks Abstract: This paper proposes a new centralized clustering
method for a data collection mechanism in wireless sensor networks, which is
based on network energy maps and Quality-of-Service (QoS) requirements.
During data collection, two mechanisms are used to reduce energy consumption:
message aggregation and filtering of redundant data. These mechanisms
generally use clustering methods in order to coordinate aggregation and
filtering. Such a clustering mechanism is used to collect data in sensor
networks. The first original aspect of this investigation consists of adding
these constraints to the clustering mechanism that helps the data collection
algorithm in order to reduce energy consumption and provide applications with
the information required without burdening them with unnecessary data.
Centralized clustering is modeled as hypergraph partitioning. Finally, results show that
a tabu search-based resolution method provides quality solutions in terms of
cluster cost and execution time. |
.Net |
28. |
Data
Security in Ad hoc Networks Using Multi Path Routing |
Java |
29. |
Data Communication Parallel Multichannel Communications Abstract: Multichannel
data communication system in which the stop-and-wait automatic-repeat request
protocol for parallel channels with an in-sequence delivery guarantee is used
for error control. Packet transmission over a single channel,
in a multichannel communication system, multiple packets are sent at a time,
one packet per channel, and packet transmission errors can occur across
every channel. To implement error control through retransmission of packets
in a multichannel communication system. In a wireless communication system,
however, the transmission condition of a wireless channel changes over time,
and consequently, the channel is often severely affected by time-varying
losses. In future work, we can apply the modeling and analytical approach
presented in this paper to conducting performance studies on the
selective-repeat ARQ protocol over parallel channels with time-varying
channel models. |
.Net |
30. |
Data Transmission
using Multi Router Monitoring System |
Java |
31. |
Shortest Path Finder in Wireless Networks Abstract: In multi-hop wireless
networks, packets are transferred through routes that could be composed of
multiple relay nodes between sources and destinations. In many multi-hop
wireless networks, shortest path routing is often used for its simplicity and
scalability, and this is closely approximated by straight line routing for
large multi-hop wireless networks. Thus, in this paper, we will focus on
straight line routing for delivering packets from sources to destinations. It
has been traditionally believed that shortest path (or straight line) routing
could lead to hot spots in the network, degrading the network performance. |
.Net |
32. |
Best Effort Multimedia Services Abstract: In the wireless systems with
time-varying channels, the resource allocation algorithm can exploit channel
variation to enhance the system performance. We consider the video streaming
service as the representative RT service since it generates massive traffic
in comparison with other multimedia services. For the BE services, we
consider the required average transmission rate as the QoS requirement, to
prevent the long starvation of some users and the excessive delay of their
packets. This policy is particularly helpful for the Internet services using
the transmission control protocol (TCP). |
.Net |
33. |
Routing and
Security in Mobile Ad Hoc Networks |
Java |
34. |
Multiple Copy
Case using Mobile Networks Abstract: In
this work, we investigated the problem of multi-copy routing in
intermittently connected mobile networks. In addition to the cases of
wireless Internet access and ad hoc networks, the need to depart from the traditional
networking practices has been recognized for a number of emerging wireless
applications. We proposed two efficient multi-copy schemes, called Spray and
Wait and Spray and focus from the perspective of functionality, spray routing
can be viewed as a tradeoff between single and multiple copy techniques.
Despite this, theory and simulations show that spray routing. |
.Net |
35. |
Parallel File
Downloading Peer-To-Peer Networks
Abstract: PEER-TO-PEER
(P2P) technology is heavily used for content distribution applications. The
early model for content distribution is a centralized one, in which the
service provider simply sets up a server and every user downloads files from
it. In this type of network architecture (server-client), many users have to
compete for limited resources in terms of bottleneck bandwidth or processing
power of a single server. As a result, each user may receive very good
performance. P2P technology tries to solve the issue of scalability by making
the system distributed. Each computer (peer) in the network can act as both a
server and a client at the same time. It is obvious that as time goes on, the
service capacity of the entire network will increase due to the increase in
the number of servicing peers. In other words, users of a P2P network should enjoy much faster downloads. |
Java |
36. |
A Secure Routing
Protocol for mobile Ad-hoc Network
Abstract: In this project, we proposed an efficient Secure Routing Protocol for mobile ad hoc networks that guarantees the discovery of correct connectivity information over an unknown network, in the presence of malicious nodes. The protocol introduces a set of features, such as the requirement that the query verifiably arrives at the destination, the explicit binding of network and routing layer functionality, the consequent verifiable return of the query response over the reverse of the query propagation route, the acceptance of route error messages only when generated by nodes on the actual route, the query/reply identification by a dual identifier, the replay protection of the source and destination nodes and the regulation of secret keys. |
Java |
37. |
Proxy Server Connect and Re-Connect using
Bank Application
Abstract:
We
describe a system called Parent Proxy that demonstrates an alternative
approach to achieving consistent access to objects by edge proxies while
retaining the proxies’ load-dispersing and latency-reducing effects. Parent
Proxy organizes the proxies in a tree rooted at the server. The tree is
structured so that geographically close proxies reside close to one another
in the tree. To perform certain types of operations, a proxy uses the tree to
migrate each involved object to it self and then performs the operation
locally. Although this incurs the expense of object migration for some
operations and is thus reasonable only if objects are not too large and
operations involve only a few, it also promises performance benefits of
applications. |
Java |
38. |
Intrusion
Detection in Wireless Sensor Networks
Abstract: Intrusion detection in Wireless Sensor Network (WSN) is of practical interest in many applications such as detecting an intruder in a battlefield. The intrusion detection is defined as a mechanism for a WSN to detect the existence of inappropriate, incorrect, or anomalous moving attackers. Analyzes the intrusion detection problem in WSNs by characterizing intrusion detection probability with respect to the intrusion distance and the network parameters. Two detection models are considered: single-sensing detection and multiple-sensing detection models. The analytical model for intrusion detection allows us to analytically formulate intrusion detection probability within a certain intrusion distance under various application scenarios. |
Java |
39. |
ATM Networks for
Online Monitoring System
Abstract: The TCP/IP protocol suite is the standard requirement for all applications that need to communicate over the Internet. As TCP/IP applications are unable to specify the QoS parameters needed for most Asynchronous Transfer Mode (ATM) services, we tend to use the GCRA Algorithm. The purpose of Cell-Rate Guarantees for Traffic across ATM Network is to provide QoS. ATM is a connection-oriented switching technology, utilizing statistical multiplexing of fixed-length packets, known as cells. The purpose of traffic control is to minimize congestion. In an ATM network when the Source Machine continuously sends cells to the Destination Machine through the Router Machine, there will be a possibility of occurring congestion. When congestion occurs the Routing Machine cannot accept more cells and hence these cells will be discarded. This causes regeneration and retransmission of the discarded ATM cells. The objective of this project is to simulate an overflowing ATM network and establish a router with congestion control based on the GCRA algorithm. |
Java |
40. |
Create Databases
Watermarking
Abstract: We present a mechanism for proof of ownership based on the secure embedding of a robust imperceptible watermark in relational data. We formulate the watermarking of relational databases as a constrained optimization problem and discuss efficient techniques to solve the optimization problem and to handle the constraints. Watermark decoding is based on a threshold-based technique characterized by an optimal threshold that minimizes the probability of decoding errors. We implemented a proof of concept implementation of our watermarking technique and showed by experimental results that our technique is resilient to tuple deletion, alteration, and insertion attacks. |
C# .Net |
41. |
Data Caching In
Mobile Ad Hoc Networks
Abstract: Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. The problem of optimal placement of caches to reduce overall cost of accessing data is motivated by the following two defining characteristics of ad hoc networks. Firstly, the ad hoc networks are multi hop networks without a central base station. Thus, remote access of information typically occurs via multi-hop routing, which can greatly benefit from caching to reduce access latency. Secondly, the network is generally resource constrained in terms of channel bandwidth or battery power in the nodes. Caching helps in reducing communication, which results in savings in bandwidth as well as battery energy. The problem of cache placement is particularly challenging when each network node has limited memory to cache data items. |
Java |
42. |
E-Mail Server
Using Multithreaded Sockets
|
Java |
43. |
Video Multicasting in Muilticellular
Wireless Networks
Abstract: In this paper, we propose a new mechanism to select the cells and the wireless technologies for layer-encoded video multicasting in the heterogeneous wireless networks. Video delivery in wireless networks is becoming an important multimedia application due to the proliferation of the Web-based services and the rapid growth of wireless communication devices. The most significant layer, that is, the base layer, contains the data representing the most important features of the video, whereas the additional layers, that is, the enhancement layers, contain data that progressively refine the reconstructed video quality. The layers are distributed to receivers via multicast channels in wireless networks. |
Java |
44. |
Subscription Based
Online Book Shop
Abstract: Our dissemination approach thus represents an efficient and secure mechanism for use in applications such as publish–subscribe systems for XML Documents. The publish–subscribe model restricts the consumer and document source information to the routers to which they register with. Our framework facilitates dissemination of contents with varying degrees of confidentiality and integrity requirements in a mix of trusted and untrusted networks, which is prevalent in current settings across enterprise networks and the web. Also, it does not require the routers to be aware of any security policy in the sense that the routers do not need to implement any policy related to access control. |
.Net |
45. |
2-D Grayscale Morphological
Abstract: A new method for computing morphological operations with arbitrary 2-D flat structuring elements faster than our preliminary version. It has a computational complexity that is independent of the number of gray levels in the image. The proposed method has a clear computational performance advantage easily decomposed into linear structuring elements. Commercial and open source image processing software for performing morphological operations was found to be either quite slow, being based on an processor optimized version of the direct algorithm or fast but limited to rectangular. |
.Net |
46. |
Online Traffic Routing Under Information
Provision Tourism Department
Abstract: Fuzzy control through a rule-based mechanism can be used to determine behavior-consistent route information based control strategies for route guidance to robustly respond to the performance enhancement objectives of a system controller in a dynamic vehicular traffic system. BC strategies explicitly factor the likely driver response behavior to information provision in determining the controller-proposed route guidance strategies. The fuzzy control model defines a fuzzy system that continuously seeks real-time information-based control strategies to improve the overall vehicular traffic system performance. The controller uses these SO route assignment proportions and an iterative procedure involving a controller-estimated model of driver behavior and the fuzzy control model, to generate routing strategies to provide route guidance to drivers so that the actual driver decisions in the next stage result in close to the route proportions. |
.Net |
47. |
Image Processing
for Real-Time 3-D Data Acquisition
|
.Net |
48. |
Multiple
Information Providers on Web
|
Java |
49. |
Optimal Multicast
Routing in Mobile Ad-Hoc Networks
|
Java |
50. |
Automated
Containment of Worms
|
Java |
51. |
Medical Image
Retrieval
|
.Net |
52. |
Data Embedding for
Binary Images in Morphological
|
.Net |
53. |
Credit Card Fraud
Detection
|
.Net |
54. |
Network Border
Patrol Preventing Congestion Collapse
|
Java |
55. |
Rule Mining
Algorithm in Distributed Databases
|
Java |
56. |
Distributed
Metadata Management for Large Cluster-Based Storage Systems
|
.Net |
57. |
Scalable Wireless Ad-Hoc Network Simulation using XTC |
Java |
58. |
Sports
Video Retrieval |
.Net |
59. |
Cache Updating Dynamic source routing
protocol
|
Java |
60. |
Face
Recognition |
Java |
61. |
Shortest
Node Finder in Wireless Ad-Hoc Networks
|
Java |
62. |
Image
Processing Techniques for Image Crack Detection and Removal
|
. Net |
63. |
Next-Generation Global
Roaming Mobile Networks |
Java |
64. |
Java Visual Editor
with Compiler
|
Java |
65. |
Noise Reduction Image Filtering
|
Java |
66. |
Online
Handwritten Script Recognition |
Java |
67. |
Image
Processing for Structure and Texture Filling-in of Missing Image Blocks |
Java |
68. |
An Image
Transport Protocol for the Internet |
Java |
69. |
Hybrid
Intrusion Detection Abstract: Hybrid INTRUSIONS and anomalies are two different kinds of abnormal
traffic events in an open network environment. An intrusion takes place when
an unauthorized access of a host computer system is attempted. An anomaly is
observed at the network connection level. Both attack types may compromise
valuable hosts, disclose sensitive data, deny services to legitimate users,
and pull down network based computing resources. The intrusion detection
system (IDS) offers intelligent protection of networked computers or
distributed resources much better than using fixed-rule. Signature matching
is based on a misuse model, whereas anomaly detection is based on a normal
use model. The design philosophies of these two models are quite different,
and they were rarely mixed up in existing IDS products from the security
industry. |
J2EE |
70. |
Video
Steganography |
Java |
71. |
Neural
Networks for Unicode Optical Character Recognition |
C# . Net |
72. |
An Acknowledgment-Based Approach
for The Detection Of Routing in MANETs |
Java |
73. |
Mobile
Agents In Distributed Multimedia Database Systems |
Java |
74. |
Image Stream
Transfer Using Real-Time Transmission Protocol |
Java |
75. |
Personal Authentication Using 3-D Finger Geometry
|
Java |
76. |
A Memory
Learning Framework for Effective Image Retrieval |
Java |
77. |
Neural
Networks for Handwritten character and Digits |
VC++ |
78. |
Evaluating
the Performance of Versatile RMI Approach In Java |
Java |
79. |
Effective Packet
Analyzing and Filtering System for ATM Network |
Java |
80. |
Selective Encryption of
Still Image |
VB, C,Java |
81. |
Homogenous
Network Control and Implementation |
Java |
82. |
Retrieving Files
Using Content Based Searching and presenting it in Carousel view |
Java |
83. |
Embedding in Video
Steganography |
Java |
84. |
Genetic
Algorithm Based Train Simulation Using Concurrent Engineering |
Java |
85. |
Location Aided
Routing for Mobile Ad-Hoc Networks |
Java |
86. |
Flood Fill
Algorithms in C# and GDI+ |
C# .Net |
87. |
Genetic
Algorithms and the Traveling Salesman Problem using C# and ATL COM |
C# .Net |
88. |
Hiding
messages in the Noise of a Picture |
C# .Net |
89. |
Windows
Management Instrumentation WMI Implementation |
C#.Net |
90. |
Steganography
for Hiding Data in Wave Audio Files |
C# Net |
91. |
Neural
Network for Recognition of Handwritten and Digits Backpropagation |
VC++ |
92. |
Optimal Cryptographic
Technique |
.Net |
93. |
XML Enabled
SQL SERVER |
Java |
94. |
An
efficient message digest algorithm (MD) for data security |
VC++ |
95. |
Hopfield
model of neural network for pattern recognition |
C# Net |
96. |
Using Trigonometry
and Pythagoras to Watermark an Image |
C# .Net |
97. |
Hiding messages in the Noise of a Picture |
C# .Net |
98. |
ERP for Leather Company |
J2EE |
99. |
Cryptographically Using Secure Server/Client Protocol |
VC++ |
100. |
Neural Networks
for Handwriting Detection System Using Brain Net
|
VB .Net |
101. |
Image
Rendering for Grid Technology |
Java |
102. |
Java Network
File Sharing System |
Java |
103. |
Java Visual
Editor with Compiler |
Java |
104. |
E-Mail Server
Using Multithreaded Sockets |
Java |
105. |
Network
Component for XML Migration |
Java |
106. |
Image Water
Marking and Combustion |
Java |
107. |
Image
Processing for Convolution Filters |
C# .Net |
108. |
Artificial intelligence
network load balancing using Ant Colony Optimization |
C# .Net |
109. |
Image
Processing for Edge Detection Filters |
C# .Net |
110. |
Active
Learning Methods for Interactive Image Retrieval |
C# .Net |
111. |
Image Stream Transfer Using Real-Time Transmission
Protocol |
Java |
S.N. |
C# .Net Project Titles |
Lang |
1. |
CVS Root File Changing Utility |
C# .Net |
2. |
C# MP3 Compressor |
C# .Net |
3. |
Convolution Filters |
C# .Net |
4. |
Database Schema Comparison
Utility C# |
C# .Net |
5. |
Displacement filters,
including swirl using GDI+ |
C# .Net |
6. |
Edge Detection Filters |
C# .Net |
7. |
Flood Fill Algorithms in C#
and GDI+ |
C# .Net |
8. |
Genetic Algorithms and the Traveling
Salesman Problem using C# and ATL COM |
C# .Net |
9. |
Hiding binary data in HTML
documents |
C# .Net |
10. |
Hiding Messages in MIDI Songs |
C# .Net |
11. |
Hiding messages in the Noise
of a Picture |
C# .Net |
12. |
Image Processing |
C# .Net |
13. |
Windows Management
Instrumentation WMI Implementation |
C# .Net |
14. |
Image Processing for
Bilinear Filters and Resizing |
C# .Net |
15. |
Image processing for
HSL color space |
C# .Net |
16. |
Image Processing for Per
Pixel Filters using GDI+ |
C# .Net |
17. |
Multithreaded Chat Server |
C# .Net |
18. |
Reading and Writing AVI files
using steganography |
C# .Net |
19. |
Steganography for Hiding Data
in Wave Audio Files |
C# .Net |
20. |
TCPIP Chat client server Using
C# |
C# .Net |
21. |
Neural Networks for
Unicode Optical Character Recognition |
C# .Net |
22. |
Using Trigonometry and
Pythagoras to Watermark an Image |
C# .Net |
23. |
Library Management System |
C# .Net |
24. |
Steganography for FTP through a
Proxy Server |
C# .Net |
25. |
Artificial intelligence
network load balancing using Ant Colony Optimization |
C# .Net |
S.N. |
ASP .Net Project Titles |
Lang |
26. |
Call Center Management System |
ASP .Net |
27. |
Online Shopping |
ASP .Net |
28. |
Textile Web Services |
ASP .Net |
29. |
Auction System |
ASP .Net |
30. |
Online Quiz |
ASP .Net |
31. |
Online Bank |
ASP .Net |
32. |
Online Voting System |
ASP .Net |
33. |
Securing Image URL |
ASP .Net |
34. |
Web Services |
ASP .Net |
35. |
Smart Knowledge Provider |
ASP .Net |
36. |
Online Book Shop |
ASP .Net |
37. |
Electronic Fund Transfer |
ASP .Net |
38. |
Work Flow Management System |
ASP .Net |
39. |
Online Customer Care |
ASP .Net |
40. |
Scribe Automation |
ASP .Net |
41. |
Textile Management System |
ASP .Net |
42. |
Sales and Purchase Management
System |
ASP .Net |
43. |
Human Resources Management
System |
ASP .Net |
44. |
Inventory Manage System |
ASP .Net |
45. |
Job Order System |
ASP .Net |
46. |
Advertisement Posting Website
ASP .Net |
ASP .Net |
47. |
Mobile shop shopping cart
System |
ASP .Net |
48. |
Patient Management System |
ASP .Net |
49. |
Property Management System |
ASP .Net |
50. |
Web Based Content Management System |
ASP .Net |
S.N. |
VB .Net Project Titles |
Lang |
51. |
Neural Networks for
Handwriting Detection System Using Brain Net |
VB
.Net |
52. |
Library Management system |
VB
.Net |
53. |
Windows Management Instrument
(WMI) .Net 2005 |
VB
.Net |
54. |
Wallpaper Changer Utility |
VB
.Net |
55. |
Win Application for Word
Processing |
VB
.Net |
56. |
Screen capture Utility |
VB
.Net |
57. |
HTML Editor |
VB
.Net |
58. |
Image Converter 2005 |
VB
.Net |
59. |
Internet History Viewer |
VB .Net |
60. |
VB .Net Smart Mail Transfer
Protocol |
VB
.Net |
61. |
Windows Multi File Search
utility |
VB
.Net |
62. |
Message Digest |
VB
.Net |
63. |
FTP Explorer |
VB
.Net |
64. |
Convolution Filter |
VB
.Net |
65. |
Find and Replace utility |
VB
.Net |
66. |
Apartment Management
System |
VB
.Net |
67. |
Computerized Information
Software |
VB
.Net |
68. |
Employee Management System |
VB
.Net |
69. |
Hotel Management System |
VB
.Net |
70. |
Human Resources Management
System |
VB
.Net |
71. |
Inventory System |
VB
.Net |
72. |
Membership Management System |
VB
.Net |
73. |
Patient Care System |
VB
.Net |
74. |
Send SMS To Cell Phone
Through SMTP Mail |
VB
.Net |
75. |
Trainee Management System |
VB
.Net |
S.N. |
J2EE Project Titles |
Language |
1. |
ERP for Leather Company |
J2EE |
2. |
Online Web shop |
J2EE |
3. |
Online Fashion Studios |
J2EE |
4. |
ERP for Small Business |
J2EE |
5. |
Bulk Billing System |
J2EE |
S.N. |
VC++ Project Titles |
Language |
1. |
Cryptographically Using
Secure Server/Client Protocol |
VC++ |
2. |
Intrusion Detection
Prevention And Trace back Systems |
VC++ |
3. |
Neural Network for
Recognition of Handwritten and Digits |
VC++ |
4. |
The File Digest program and
the C++ implementation of some Message-Digest algorithms |
VC++ |
5. |
File Encryption and Encrypted
text embedding in an image |
VC++ |
6. |
Performance Evaluation of
DISTANCE Routing Algorithm in MANET |
VC++ |